0.06/0.12 % Problem : SLH375^1 : TPTP v7.5.0. Released v7.5.0. 0.06/0.13 % Command : run_E %s %d THM 0.13/0.34 % Computer : n011.cluster.edu 0.13/0.34 % Model : x86_64 x86_64 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.34 % Memory : 8042.1875MB 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.34 % CPULimit : 30 0.13/0.34 % WCLimit : 30 0.13/0.34 % DateTime : Tue Aug 9 02:49:36 EDT 2022 0.13/0.35 % CPUTime : 0.20/0.47 The problem SPC is TH0_THM_EQU_NAR 0.20/0.47 Running higher-order on 1 cores theorem proving 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=1 --cpu-limit=30 /export/starexec/sandbox/benchmark/theBenchmark.p 0.20/0.48 # Version: 3.0pre003-ho 0.20/0.58 # Preprocessing class: HSLSSMSMSSSNHFA. 0.20/0.58 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 0.20/0.58 # Starting new_ho_10 with 30s (1) cores 0.20/0.58 # new_ho_10 with pid 15211 completed with status 0 0.20/0.58 # Result found by new_ho_10 0.20/0.58 # Preprocessing class: HSLSSMSMSSSNHFA. 0.20/0.58 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 0.20/0.58 # Starting new_ho_10 with 30s (1) cores 0.20/0.58 # No SInE strategy applied 0.20/0.58 # Search class: HGHSM-FSLM32-MHFFFSBC 0.20/0.58 # Scheduled 5 strats onto 1 cores with 30 seconds (30 total) 0.20/0.58 # Starting additional_ho_6 with 17s (1) cores 0.20/0.58 # additional_ho_6 with pid 15212 completed with status 0 0.20/0.58 # Result found by additional_ho_6 0.20/0.58 # Preprocessing class: HSLSSMSMSSSNHFA. 0.20/0.58 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 0.20/0.58 # Starting new_ho_10 with 30s (1) cores 0.20/0.58 # No SInE strategy applied 0.20/0.58 # Search class: HGHSM-FSLM32-MHFFFSBC 0.20/0.58 # Scheduled 5 strats onto 1 cores with 30 seconds (30 total) 0.20/0.58 # Starting additional_ho_6 with 17s (1) cores 0.20/0.58 # Preprocessing time : 0.008 s 0.20/0.58 # Presaturation interreduction done 0.20/0.58 0.20/0.58 # Proof found! 0.20/0.58 # SZS status Theorem 0.20/0.58 # SZS output start CNFRefutation 0.20/0.58 thf(decl_22, type, one_one_nat: nat). 0.20/0.58 thf(decl_23, type, uminus_uminus_int: int > int). 0.20/0.58 thf(decl_24, type, uminus_uminus_real: real > real). 0.20/0.58 thf(decl_25, type, zero_zero_int: int). 0.20/0.58 thf(decl_26, type, zero_zero_nat: nat). 0.20/0.58 thf(decl_27, type, zero_zero_real: real). 0.20/0.58 thf(decl_28, type, if_nat: $o > nat > nat > nat). 0.20/0.58 thf(decl_29, type, listSl162220270list_a: list_list_a > nat > list_list_list_a). 0.20/0.58 thf(decl_30, type, listSl97544552lice_a: list_a > nat > list_list_a). 0.20/0.58 thf(decl_31, type, listSl856612276list_a: list_list_a > nat > nat > list_list_list_a). 0.20/0.58 thf(decl_32, type, listSl1495374126_aux_a: list_a > nat > nat > list_list_a). 0.20/0.58 thf(decl_33, type, bind_list_a_list_a: list_list_a > (list_a > list_list_a) > list_list_a). 0.20/0.58 thf(decl_34, type, bind_list_a_a: list_list_a > (list_a > list_a) > list_a). 0.20/0.58 thf(decl_35, type, bind_a_list_a: list_a > (a > list_list_a) > list_list_a). 0.20/0.58 thf(decl_36, type, bind_a_a: list_a > (a > list_a) > list_a). 0.20/0.58 thf(decl_37, type, count_list_list_a: list_list_a > list_a > nat). 0.20/0.58 thf(decl_38, type, count_list_a: list_a > a > nat). 0.20/0.58 thf(decl_39, type, gen_length_list_a: nat > list_list_a > nat). 0.20/0.58 thf(decl_40, type, gen_length_a: nat > list_a > nat). 0.20/0.58 thf(decl_41, type, nil_list_a: list_list_a). 0.20/0.58 thf(decl_42, type, nil_a: list_a). 0.20/0.58 thf(decl_43, type, list_ex1_list_a: (list_a > $o) > list_list_a > $o). 0.20/0.58 thf(decl_44, type, list_ex1_a: (a > $o) > list_a > $o). 0.20/0.58 thf(decl_45, type, member_list_a: list_list_a > list_a > $o). 0.20/0.58 thf(decl_46, type, member_a: list_a > a > $o). 0.20/0.58 thf(decl_47, type, semiri2019852685at_int: nat > int). 0.20/0.58 thf(decl_48, type, semiri1382578993at_nat: nat > nat). 0.20/0.58 thf(decl_49, type, semiri2110766477t_real: nat > real). 0.20/0.58 thf(decl_50, type, size_s575106428list_a: list_list_list_a > nat). 0.20/0.58 thf(decl_51, type, size_s1427607542list_a: list_list_a > nat). 0.20/0.58 thf(decl_52, type, size_size_list_a: list_a > nat). 0.20/0.58 thf(decl_53, type, ord_less_int: int > int > $o). 0.20/0.58 thf(decl_54, type, ord_less_nat: nat > nat > $o). 0.20/0.58 thf(decl_55, type, ord_less_real: real > real > $o). 0.20/0.58 thf(decl_56, type, ord_less_eq_int: int > int > $o). 0.20/0.58 thf(decl_57, type, ord_less_eq_nat: nat > nat > $o). 0.20/0.58 thf(decl_58, type, power_power_int: int > nat > int). 0.20/0.58 thf(decl_59, type, power_power_nat: nat > nat > nat). 0.20/0.58 thf(decl_60, type, power_power_real: real > nat > real). 0.20/0.58 thf(decl_61, type, divide_divide_int: int > int > int). 0.20/0.58 thf(decl_62, type, divide_divide_nat: nat > nat > nat). 0.20/0.58 thf(decl_63, type, divide_divide_real: real > real > real). 0.20/0.58 thf(decl_64, type, collect_nat: (nat > $o) > set_nat). 0.20/0.58 thf(decl_65, type, member_nat: nat > set_nat > $o). 0.20/0.58 thf(decl_66, type, k: nat). 0.20/0.58 thf(decl_67, type, xs: list_a). 0.20/0.58 thf(decl_68, type, esk1_1: (list_list_a > $o) > list_list_a). 0.20/0.58 thf(decl_69, type, esk2_1: (list_a > $o) > list_a). 0.20/0.58 thf(decl_70, type, esk3_1: nat > list_list_a). 0.20/0.58 thf(decl_71, type, esk4_1: nat > list_a). 0.20/0.58 thf(decl_72, type, esk5_1: (nat > $o) > nat). 0.20/0.58 thf(decl_73, type, esk6_1: (nat > $o) > nat). 0.20/0.58 thf(decl_74, type, esk7_2: set_nat > (nat > $o) > nat). 0.20/0.58 thf(decl_75, type, esk8_2: set_nat > (nat > $o) > nat). 0.20/0.58 thf(decl_76, type, esk9_1: real > real). 0.20/0.58 thf(decl_77, type, esk10_1: real > real). 0.20/0.58 thf(decl_78, type, esk11_1: real > real). 0.20/0.58 thf(decl_79, type, esk12_1: (nat > $o) > nat). 0.20/0.58 thf(decl_80, type, esk13_3: nat > set_nat > (nat > $o) > nat). 0.20/0.58 thf(decl_81, type, esk14_4: nat > (nat > nat) > nat > nat > nat). 0.20/0.58 thf(decl_82, type, esk15_4: nat > (nat > nat) > nat > nat > nat). 0.20/0.58 thf(decl_83, type, esk16_4: int > (nat > int) > nat > nat > nat). 0.20/0.58 thf(decl_84, type, esk17_4: int > (nat > int) > nat > nat > nat). 0.20/0.58 thf(decl_85, type, esk18_4: real > (nat > real) > nat > nat > nat). 0.20/0.58 thf(decl_86, type, esk19_4: real > (nat > real) > nat > nat > nat). 0.20/0.58 thf(decl_87, type, esk20_4: nat > (int > nat) > int > int > int). 0.20/0.58 thf(decl_88, type, esk21_4: nat > (int > nat) > int > int > int). 0.20/0.58 thf(decl_89, type, esk22_4: int > (int > int) > int > int > int). 0.20/0.58 thf(decl_90, type, esk23_4: int > (int > int) > int > int > int). 0.20/0.58 thf(decl_91, type, esk24_4: real > (int > real) > int > int > int). 0.20/0.58 thf(decl_92, type, esk25_4: real > (int > real) > int > int > int). 0.20/0.58 thf(decl_93, type, esk26_4: nat > (real > nat) > real > real > real). 0.20/0.58 thf(decl_94, type, esk27_4: nat > (real > nat) > real > real > real). 0.20/0.58 thf(decl_95, type, esk28_4: int > (real > int) > real > real > real). 0.20/0.58 thf(decl_96, type, esk29_4: int > (real > int) > real > real > real). 0.20/0.58 thf(decl_97, type, esk30_4: real > (real > real) > real > real > real). 0.20/0.58 thf(decl_98, type, esk31_4: real > (real > real) > real > real > real). 0.20/0.58 thf(decl_99, type, esk32_4: nat > nat > (nat > nat) > nat > nat). 0.20/0.58 thf(decl_100, type, esk33_4: nat > nat > (nat > nat) > nat > nat). 0.20/0.58 thf(decl_101, type, esk34_4: nat > nat > (nat > int) > int > nat). 0.20/0.58 thf(decl_102, type, esk35_4: nat > nat > (nat > int) > int > nat). 0.20/0.58 thf(decl_103, type, esk36_4: nat > nat > (nat > real) > real > nat). 0.20/0.58 thf(decl_104, type, esk37_4: nat > nat > (nat > real) > real > nat). 0.20/0.58 thf(decl_105, type, esk38_4: int > int > (int > nat) > nat > int). 0.20/0.58 thf(decl_106, type, esk39_4: int > int > (int > nat) > nat > int). 0.20/0.58 thf(decl_107, type, esk40_4: int > int > (int > int) > int > int). 0.20/0.58 thf(decl_108, type, esk41_4: int > int > (int > int) > int > int). 0.20/0.58 thf(decl_109, type, esk42_4: int > int > (int > real) > real > int). 0.20/0.58 thf(decl_110, type, esk43_4: int > int > (int > real) > real > int). 0.20/0.58 thf(decl_111, type, esk44_4: real > real > (real > nat) > nat > real). 0.20/0.58 thf(decl_112, type, esk45_4: real > real > (real > nat) > nat > real). 0.20/0.58 thf(decl_113, type, esk46_4: real > real > (real > int) > int > real). 0.20/0.58 thf(decl_114, type, esk47_4: real > real > (real > int) > int > real). 0.20/0.58 thf(decl_115, type, esk48_4: real > real > (real > real) > real > real). 0.20/0.58 thf(decl_116, type, esk49_4: real > real > (real > real) > real > real). 0.20/0.58 thf(decl_117, type, esk50_4: nat > (nat > nat) > nat > nat > nat). 0.20/0.58 thf(decl_118, type, esk51_4: nat > (nat > nat) > nat > nat > nat). 0.20/0.58 thf(decl_119, type, esk52_4: nat > (int > nat) > int > int > int). 0.20/0.58 thf(decl_120, type, esk53_4: nat > (int > nat) > int > int > int). 0.20/0.58 thf(decl_121, type, esk54_4: nat > (real > nat) > real > real > real). 0.20/0.58 thf(decl_122, type, esk55_4: nat > (real > nat) > real > real > real). 0.20/0.58 thf(decl_123, type, esk56_4: int > (nat > int) > nat > nat > nat). 0.20/0.58 thf(decl_124, type, esk57_4: int > (nat > int) > nat > nat > nat). 0.20/0.58 thf(decl_125, type, esk58_4: int > (int > int) > int > int > int). 0.20/0.58 thf(decl_126, type, esk59_4: int > (int > int) > int > int > int). 0.20/0.58 thf(decl_127, type, esk60_4: int > (real > int) > real > real > real). 0.20/0.58 thf(decl_128, type, esk61_4: int > (real > int) > real > real > real). 0.20/0.58 thf(decl_129, type, esk62_4: real > (nat > real) > nat > nat > nat). 0.20/0.58 thf(decl_130, type, esk63_4: real > (nat > real) > nat > nat > nat). 0.20/0.58 thf(decl_131, type, esk64_4: real > (int > real) > int > int > int). 0.20/0.58 thf(decl_132, type, esk65_4: real > (int > real) > int > int > int). 0.20/0.58 thf(decl_133, type, esk66_4: real > (real > real) > real > real > real). 0.20/0.58 thf(decl_134, type, esk67_4: real > (real > real) > real > real > real). 0.20/0.58 thf(decl_135, type, esk68_4: nat > nat > (nat > nat) > nat > nat). 0.20/0.58 thf(decl_136, type, esk69_4: nat > nat > (nat > nat) > nat > nat). 0.20/0.58 thf(decl_137, type, esk70_4: nat > nat > (nat > int) > int > nat). 0.20/0.58 thf(decl_138, type, esk71_4: nat > nat > (nat > int) > int > nat). 0.20/0.58 thf(decl_139, type, esk72_4: nat > nat > (nat > real) > real > nat). 0.20/0.58 thf(decl_140, type, esk73_4: nat > nat > (nat > real) > real > nat). 0.20/0.58 thf(decl_141, type, esk74_4: int > int > (int > nat) > nat > int). 0.20/0.58 thf(decl_142, type, esk75_4: int > int > (int > nat) > nat > int). 0.20/0.58 thf(decl_143, type, esk76_4: int > int > (int > int) > int > int). 0.20/0.58 thf(decl_144, type, esk77_4: int > int > (int > int) > int > int). 0.20/0.58 thf(decl_145, type, esk78_4: int > int > (int > real) > real > int). 0.20/0.58 thf(decl_146, type, esk79_4: int > int > (int > real) > real > int). 0.20/0.58 thf(decl_147, type, esk80_4: real > real > (real > nat) > nat > real). 0.20/0.58 thf(decl_148, type, esk81_4: real > real > (real > nat) > nat > real). 0.20/0.58 thf(decl_149, type, esk82_4: real > real > (real > int) > int > real). 0.20/0.58 thf(decl_150, type, esk83_4: real > real > (real > int) > int > real). 0.20/0.58 thf(decl_151, type, esk84_4: real > real > (real > real) > real > real). 0.20/0.58 thf(decl_152, type, esk85_4: real > real > (real > real) > real > real). 0.20/0.58 thf(decl_153, type, esk86_1: int > int). 0.20/0.58 thf(decl_154, type, esk87_1: real > real). 0.20/0.58 thf(decl_155, type, esk88_1: nat > nat). 0.20/0.58 thf(decl_156, type, esk89_1: int > int). 0.20/0.58 thf(decl_157, type, esk90_1: real > real). 0.20/0.58 thf(decl_158, type, esk91_2: set_nat > (nat > $o) > nat). 0.20/0.58 thf(decl_159, type, esk92_2: real > real > real). 0.20/0.58 thf(decl_160, type, esk93_1: (nat > $o) > nat). 0.20/0.58 thf(decl_161, type, esk94_1: (nat > $o) > nat). 0.20/0.58 thf(decl_162, type, esk95_2: (nat > $o) > nat > nat). 0.20/0.58 thf(decl_163, type, esk96_1: (nat > $o) > nat). 0.20/0.58 thf(decl_164, type, esk97_1: (nat > nat > $o) > nat). 0.20/0.58 thf(decl_165, type, esk98_1: (nat > nat > $o) > nat). 0.20/0.58 thf(decl_166, type, esk99_1: (nat > nat > $o) > nat). 0.20/0.58 thf(decl_167, type, esk100_1: (nat > nat > $o) > nat). 0.20/0.58 thf(decl_168, type, esk101_1: (nat > nat > $o) > nat). 0.20/0.58 thf(decl_169, type, esk102_1: (int > int > $o) > int). 0.20/0.58 thf(decl_170, type, esk103_1: (int > int > $o) > int). 0.20/0.58 thf(decl_171, type, esk104_1: (int > int > $o) > int). 0.20/0.58 thf(decl_172, type, esk105_1: (int > int > $o) > int). 0.20/0.58 thf(decl_173, type, esk106_1: (int > int > $o) > int). 0.20/0.58 thf(decl_174, type, esk107_1: (real > real > $o) > real). 0.20/0.58 thf(decl_175, type, esk108_1: (real > real > $o) > real). 0.20/0.58 thf(decl_176, type, esk109_1: (real > real > $o) > real). 0.20/0.58 thf(decl_177, type, esk110_1: (real > real > $o) > real). 0.20/0.58 thf(decl_178, type, esk111_1: (real > real > $o) > real). 0.20/0.58 thf(decl_179, type, esk112_1: real > real). 0.20/0.58 thf(decl_180, type, esk113_2: real > real > real). 0.20/0.58 thf(decl_181, type, esk114_1: int > nat). 0.20/0.58 thf(decl_182, type, esk115_1: int > nat). 0.20/0.58 thf(decl_183, type, esk116_1: real > nat). 0.20/0.58 thf(decl_184, type, esk117_2: nat > real > real). 0.20/0.58 thf(decl_185, type, esk118_2: nat > real > real). 0.20/0.58 thf(decl_186, type, esk119_1: int > nat). 0.20/0.58 thf(decl_187, type, esk120_1: int > nat). 0.20/0.58 thf(decl_188, type, esk121_1: int > nat). 0.20/0.58 thf(decl_189, type, esk122_1: int > nat). 0.20/0.58 thf(decl_190, type, esk123_1: int > nat). 0.20/0.58 thf(decl_191, type, esk124_1: int > nat). 0.20/0.58 thf(decl_192, type, esk125_1: int > nat). 0.20/0.58 thf(decl_193, type, esk126_1: (int > int > $o) > int). 0.20/0.58 thf(decl_194, type, esk127_1: (int > int > $o) > int). 0.20/0.58 thf(decl_195, type, epred1_1: set_nat > nat > $o). 0.20/0.58 thf(fact_42_length__0__conv, axiom, ![X2:list_list_a]:((((size_s1427607542list_a @ X2)=(zero_zero_nat))<=>((X2)=(nil_list_a)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_42_length__0__conv)). 0.20/0.58 thf(fact_284_list__slice__length, axiom, ![X473:list_a, X59:nat]:(((size_s1427607542list_a @ (listSl97544552lice_a @ X473 @ X59))=(divide_divide_nat @ (size_size_list_a @ X473) @ X59))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_284_list__slice__length)). 0.20/0.58 thf(fact_285_div__less, axiom, ![X19:nat, X1:nat]:(((ord_less_nat @ X19 @ X1)=>((divide_divide_nat @ X19 @ X1)=(zero_zero_nat)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_285_div__less)). 0.20/0.58 thf(conj_0, hypothesis, (ord_less_nat @ (size_size_list_a @ xs) @ k), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_0)). 0.20/0.58 thf(conj_1, conjecture, ((listSl97544552lice_a @ xs @ k)=(nil_list_a)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_1)). 0.20/0.58 thf(c_0_5, plain, ![X1428:list_list_a]:(((((size_s1427607542list_a @ X1428)!=(zero_zero_nat))|((X1428)=(nil_list_a)))&(((X1428)!=(nil_list_a))|((size_s1427607542list_a @ X1428)=(zero_zero_nat))))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_42_length__0__conv])])). 0.20/0.58 thf(c_0_6, plain, ![X2058:list_a, X2059:nat]:(((size_s1427607542list_a @ (listSl97544552lice_a @ X2058 @ X2059))=(divide_divide_nat @ (size_size_list_a @ X2058) @ X2059))), inference(variable_rename,[status(thm)],[fact_284_list__slice__length])). 0.20/0.58 thf(c_0_7, plain, ![X2060:nat, X2061:nat]:((~(ord_less_nat @ X2060 @ X2061)|((divide_divide_nat @ X2060 @ X2061)=(zero_zero_nat)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_285_div__less])])). 0.20/0.58 thf(c_0_8, plain, ![X2:list_list_a]:((((X2)=(nil_list_a))|((size_s1427607542list_a @ X2)!=(zero_zero_nat)))), inference(split_conjunct,[status(thm)],[c_0_5])). 0.20/0.58 thf(c_0_9, plain, ![X3:list_a, X1:nat]:(((size_s1427607542list_a @ (listSl97544552lice_a @ X3 @ X1))=(divide_divide_nat @ (size_size_list_a @ X3) @ X1))), inference(split_conjunct,[status(thm)],[c_0_6])). 0.20/0.58 thf(c_0_10, plain, ![X1:nat, X19:nat]:((((divide_divide_nat @ X1 @ X19)=(zero_zero_nat))|~((ord_less_nat @ X1 @ X19)))), inference(split_conjunct,[status(thm)],[c_0_7])). 0.20/0.58 thf(c_0_11, hypothesis, (ord_less_nat @ (size_size_list_a @ xs) @ k), inference(split_conjunct,[status(thm)],[conj_0])). 0.20/0.58 thf(c_0_12, negated_conjecture, ((listSl97544552lice_a @ xs @ k)!=(nil_list_a)), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_1])])). 0.20/0.58 thf(c_0_13, plain, ![X3:list_a, X1:nat]:((((listSl97544552lice_a @ X3 @ X1)=(nil_list_a))|((divide_divide_nat @ (size_size_list_a @ X3) @ X1)!=(zero_zero_nat)))), inference(spm,[status(thm)],[c_0_8, c_0_9])). 0.20/0.58 thf(c_0_14, hypothesis, ((divide_divide_nat @ (size_size_list_a @ xs) @ k)=(zero_zero_nat)), inference(spm,[status(thm)],[c_0_10, c_0_11])). 0.20/0.58 thf(c_0_15, negated_conjecture, ((listSl97544552lice_a @ xs @ k)!=(nil_list_a)), inference(split_conjunct,[status(thm)],[c_0_12])). 0.20/0.58 thf(c_0_16, hypothesis, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13, c_0_14]), c_0_15]), ['proof']). 0.20/0.58 # SZS output end CNFRefutation 0.20/0.58 # Parsed axioms : 405 0.20/0.58 # Removed by relevancy pruning/SinE : 0 0.20/0.58 # Initial clauses : 606 0.20/0.58 # Removed in clause preprocessing : 82 0.20/0.58 # Initial clauses in saturation : 524 0.20/0.58 # Processed clauses : 800 0.20/0.58 # ...of these trivial : 15 0.20/0.58 # ...subsumed : 184 0.20/0.58 # ...remaining for further processing : 601 0.20/0.58 # Other redundant clauses eliminated : 117 0.20/0.58 # Clauses deleted for lack of memory : 0 0.20/0.58 # Backward-subsumed : 1 0.20/0.58 # Backward-rewritten : 1 0.20/0.58 # Generated clauses : 321 0.20/0.58 # ...of the previous two non-redundant : 233 0.20/0.58 # ...aggressively subsumed : 0 0.20/0.58 # Contextual simplify-reflections : 1 0.20/0.58 # Paramodulations : 198 0.20/0.58 # Factorizations : 0 0.20/0.58 # NegExts : 0 0.20/0.58 # Equation resolutions : 119 0.20/0.58 # Propositional unsat checks : 0 0.20/0.58 # Propositional check models : 0 0.20/0.58 # Propositional check unsatisfiable : 0 0.20/0.58 # Propositional clauses : 0 0.20/0.58 # Propositional clauses after purity: 0 0.20/0.58 # Propositional unsat core size : 0 0.20/0.58 # Propositional preprocessing time : 0.000 0.20/0.58 # Propositional encoding time : 0.000 0.20/0.58 # Propositional solver time : 0.000 0.20/0.58 # Success case prop preproc time : 0.000 0.20/0.58 # Success case prop encoding time : 0.000 0.20/0.58 # Success case prop solver time : 0.000 0.20/0.58 # Current number of processed clauses : 163 0.20/0.58 # Positive orientable unit clauses : 65 0.20/0.58 # Positive unorientable unit clauses: 0 0.20/0.58 # Negative unit clauses : 26 0.20/0.58 # Non-unit-clauses : 72 0.20/0.58 # Current number of unprocessed clauses: 281 0.20/0.58 # ...number of literals in the above : 733 0.20/0.58 # Current number of archived formulas : 0 0.20/0.58 # Current number of archived clauses : 328 0.20/0.58 # Clause-clause subsumption calls (NU) : 16653 0.20/0.58 # Rec. Clause-clause subsumption calls : 12016 0.20/0.58 # Non-unit clause-clause subsumptions : 107 0.20/0.58 # Unit Clause-clause subsumption calls : 362 0.20/0.58 # Rewrite failures with RHS unbound : 0 0.20/0.58 # BW rewrite match attempts : 5 0.20/0.58 # BW rewrite match successes : 1 0.20/0.58 # Condensation attempts : 0 0.20/0.58 # Condensation successes : 0 0.20/0.58 # Termbank termtop insertions : 46712 0.20/0.58 0.20/0.58 # ------------------------------------------------- 0.20/0.58 # User time : 0.079 s 0.20/0.58 # System time : 0.010 s 0.20/0.58 # Total time : 0.089 s 0.20/0.58 # Maximum resident set size: 4588 pages 0.20/0.58 0.20/0.58 # ------------------------------------------------- 0.20/0.58 # User time : 0.091 s 0.20/0.58 # System time : 0.012 s 0.20/0.58 # Total time : 0.103 s 0.20/0.58 # Maximum resident set size: 2428 pages 0.20/0.58 EOF